Round-Based Public Transit Routing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Round-Based Public Transit Routing

We study the problem of computing all Pareto-optimal journeys in a dynamic public transit network for two criteria: arrival time and number of transfers. Existing algorithms consider this as a graph problem, and solve it using variants of Dijkstra’s algorithm. Unfortunately, this leads to either high query times or suboptimal solutions. We take a different approach. We introduce RAPTOR, our nov...

متن کامل

Round-Based Public Transit Routing (Extended Abstract)

We study the problem of computing best connections in public transit networks. A common approach models the network as a graph (Pyrga et al. 2008) on which it runs a shortest path algorithm (Dijkstra 1959). To enable interactive queries, a variety of speedup techniques exist that use a preprocessing stage to accelerate queries (Delling et al. 2009; Bast et al. 2010). Unfortunately, developed wi...

متن کامل

Trip-Based Public Transit Routing

We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70 ms after a pre...

متن کامل

Trip-Based Public Transit Routing Using Condensed Search Trees

We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the trip-based model [26] focuses on trips and transfers between them, constructing journeys as a sequence of trips. In this paper, we develop a speed-up technique ...

متن کامل

Intermodal Public Transit Routing using Linked Connections

Ever since public transit agencies have found their way to the Web, they inform travelers using route planning software made available on their website. These travelers also need to be informed about other modes of transport, for which they have to consult other websites, or for which they have to ask the transit agency’s server maintainer to implement new functionalities. In this demo, we intr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Science

سال: 2015

ISSN: 0041-1655,1526-5447

DOI: 10.1287/trsc.2014.0534